Shuffle Memory System
نویسنده
چکیده
This paper proposes a new memory system called shuffle memory. The shuffle memory is a generalization of transposition memory that has been widely used in 2-D Discrete Cosine Transform and Discrete Fourier Transform. The shuffle memory is the first memory system that receives M N inputs in row major while providing M N outputs in column major order using only M N memory space. Shuffle memory can provide memory efficient architectures for separable 2-D transforms and separable 2-D filter banks.
منابع مشابه
Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access
In the present paper, we introduce and study the problem of computing, for any given finite set of words, a shuffle word with a minimum so-called scope coincidence degree. The scope coincidence degree is the maximum number of different symbols that parenthesise any position in the shuffle word. This problem is motivated by an application of a new automaton model and can be regarded as the probl...
متن کاملOptimizing Shuffle Performance in Spark
Spark [6] is a cluster framework that performs in-memory computing, with the goal of outperforming disk-based engines like Hadoop [2]. As with other distributed data processing platforms, it is common to collect data in a manyto-many fashion, a stage traditionally known as the shuffle phase. In Spark, many sources of inefficiency exist in the shuffle phase that, once addressed, potentially prom...
متن کاملA Product Machine Model for Anomaly Detection of Interposition Attacks on Cyber-Physical Systems
In this paper we propose an anomaly intrusion detection model based on shuffle operation and product machines targeting persistent interposition attacks on control systems. These attacks actually are undetectable by the most advanced system call monitors as they issue no system calls and are stealthy enough to transfer control to hijacked library functions without letting their saved instructio...
متن کاملFault-Tolerance and Permutation Analysis of ASEN and its Variant
High performance computing systems can be designed using parallel processing. The effectiveness of these parallel systems rests primarily on the communication network linking processors and memory modules. Hence, an interconnection network that provides the desired connectivity and performance at minimum cost is required. The design of a suitable interconnection network for inter-processor comm...
متن کاملAssociativity of Infinite Synchronized Shuffles and Team Automata
Motivated by different ways to obtain team automata from synchronizing component automata, we consider various definitions of synchronized shuffles of words. A shuffle of two words is an interleaving of their symbol occurrences which preserves the original order of these occurrences within each of the two words. In a synchronized shuffle, however, also two occurrences of one symbol, each from a...
متن کامل